TS2PACK: A two-level tabu search for the three-dimensional bin packing problem
نویسندگان
چکیده
منابع مشابه
TS2PACK: A two-level tabu search for the three-dimensional bin packing problem
Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins. This latter procedure is based on the Interval Graph representati...
متن کاملTSPACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem
Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins. This latter procedure is based on the Interval Graph representati...
متن کاملGuided Local Search for the Three-Dimensional Bin-Packing Problem
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...
متن کاملProbabilistic Tabu Search with Exponential Neighborhood for Bin Packing Problem
The one-dimensional bin packing problem is defined as follows [2]. Given a finite set I = {1, . . . , n} of items and two constants c and m. Each item has a positive weight wi > 0. Is it possible to partition the set I into m subsets such that the total weight of items in each subset doesn’t exceed c? This decision problem is NP-complete in strong sense and closely related to the following sche...
متن کاملThe Three-Dimensional Bin Packing Problem
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely diicult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1 8. An exact algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2009
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.06.063